Stacking models for nearly optimal link prediction in complex networks
نویسندگان
چکیده
منابع مشابه
Link Prediction in Complex Networks: A Survey
Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, and so on. This article summaries recent progress about link prediction algorithms, emphasizing on the contributions from physical perspectives ...
متن کاملImproving Link Prediction Algorithms in Complex Networks
Nowadays, the link prediction problem in complex networks has attracted much attention. There are some difficulties in solving this problem, such as scarcity and huge size of networks. Most of the previous works have low efficiency. There are some solutions for this problem and we try to combine these solutions to find a better one. Our experiments in coauthorship networks show the truth of our...
متن کاملpresenting a new method for link prediction in social networks
today, online social networks are very popular due to the possibility of creating relationships between people all over the world. these social networks with possibilities such as friend recommendation generally use local features derived from social graph structure. for friend recommendation, there are different algorithms with local and global approaches. in this paper, we proposed an algorit...
متن کاملA Noise-Filtering Method for Link Prediction in Complex Networks
Link prediction plays an important role in both finding missing links in networked systems and complementing our understanding of the evolution of networks. Much attention from the network science community are paid to figure out how to efficiently predict the missing/future links based on the observed topology. Real-world information always contain noise, which is also the case in an observed ...
متن کاملMutual information model for link prediction in heterogeneous complex networks
Recently, a number of meta-path based similarity indices like PathSim, HeteSim, and random walk have been proposed for link prediction in heterogeneous complex networks. However, these indices suffer from two major drawbacks. Firstly, they are primarily dependent on the connectivity degrees of node pairs without considering the further information provided by the given meta-path. Secondly, most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2020
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1914950117